Tuning MAX–MIN Ant System with off-line and on-line methods

نویسندگان

  • Paola Pellegrini
  • Thomas Stützle
  • Mauro Birattari
چکیده

In this paper, we study two approaches for tuning parameters of optimization algorithms: off-line and on-line tuning. The goal of tuning is to find an appropriate configuration of an algorithm, where a configuration is a specific setting of all parameters. In off-line tuning, the appropriate configuration is chosen after a preliminary phase. In on-line tuning, the configuration might be changed during the solution process to adapt to the instance being solved and possibly to the state of the search. Parameter tuning is very important in swarm intelligence: the performance of many techniques is strongly influenced by the configuration chosen. In this paper, we study the performance of MAX–MIN Ant System when its parameters are tuned off-line and when they are tuned on-line. We consider one off-line and five on-line methods, and we tackle two combinatorial optimization problems. The results show that off-line tuning generally outperforms on-line tuning. In some cases, on-line tuning achieves better results than off-line tuning, but the best on-line method is not always the same.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Companion to Off-line vs. On-line tuning: MAX–MIN Ant System for the TSP

In the paper [1] we compare the results achieved with off-line and on-line tuning approaches. In particular, we report the results of an experimental study based onMAX–MIN Ant System (MMAS) for the traveling salesman problem (TSP). In this framework, we analyze the impact on the performance of online tuning of the number of parameters adapted. Moreover, thanks to a social experiment carried out...

متن کامل

Companion to Off-line and On-line Tuning: A Study on Operator Selection for a Memetic Algorithm Applied to the QAP

In the paper [1] we study the performance of three memetic algorithms when their configuration is tuned either off-line or on-line. We assess the relative performance achieved by algorithms of different quality tuned either off-line or on-line. We tackle the quadratic assignment problem. The results suggest that off-line tuning achieves in general better performance than on-line tuning. On-line...

متن کامل

Off-line vs. On-line Tuning: A Study on MAX–MIN Ant System for the TSP

Stochastic local search algorithms require finding an appropriate setting of their parameters in order to reach high performance. The parameter tuning approaches that have been proposed in the literature for this task can be classified into two families: on-line and off-line tuning. In this paper, we compare the results we achieved with these two approaches. In particular, we report the results...

متن کامل

طراحی بهینه ابعاد شبکه جمع‌آوری فاضلاب با استفاده از الگوریتم بهینه‌سازی جامعه مورچگان: مقایسه عملکرد چهار الگوریتم

In this paper, the features of Ant Colony Optimization Algorithm (ACOA) are used to find optimal size for sewer network. Two different formulations are proposed. In the first formulation, pipes diameters and in the second formulation, nodal elevations of sewer network are taken as decision variables of the problem. In order to evaluate the performance of different ACOAs, four algorithms of Ant ...

متن کامل

Tuning of Extended Kalman Filter using Self-adaptive Differential Evolution Algorithm for Sensorless Permanent Magnet Synchronous Motor Drive

In this paper, a novel method based on a combination of Extended Kalman Filter (EKF) with Self-adaptive Differential Evolution (SaDE) algorithm to estimate rotor position, speed and machine states for a Permanent Magnet Synchronous Motor (PMSM) is proposed. In the proposed method, as a first step SaDE algorithm is used to tune the noise covariance matrices of state noise and measurement noise i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010